On New Forms of the Ergodic Theorem

نویسندگان

  • V. V. KOZLOV
  • D. V. TRESCHEV
چکیده

We present generalizations of the classical Birkhoff and von Neumann ergodic theorems, where the time average is replaced by a more general average, including some density.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Individual ergodic theorem for intuitionistic fuzzy observables using intuitionistic fuzzy state

The classical ergodic theory hasbeen built on σ-algebras. Later the Individual ergodictheorem was studied on more general structures like MV-algebrasand quantum structures. The aim of this paper is to formulate theIndividual ergodic theorem for intuitionistic fuzzy observablesusing  m-almost everywhere convergence, where  m...

متن کامل

Non-linear ergodic theorems in complete non-positive curvature metric spaces

Hadamard (or complete $CAT(0)$) spaces are complete, non-positive curvature, metric spaces. Here, we prove a nonlinear ergodic theorem for continuous non-expansive semigroup in these spaces as well as a strong convergence theorem for the commutative case. Our results extend the standard non-linear ergodic theorems for non-expansive maps on real Hilbert spaces, to non-expansive maps on Ha...

متن کامل

ON LOCAL HUDETZ g-ENTROPY

In this paper, a local approach to the concept of Hudetz $g$-entropy is presented. The introduced concept is stated in terms of Hudetz $g$-entropy. This representation is based on the concept of $g$-ergodic decomposition which is a result of the Choquet's representation Theorem for compact convex metrizable subsets of locally convex spaces.

متن کامل

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003